Linear Computer-Music through Sequences over Galois Fields
نویسندگان
چکیده
It is shown how binary sequences can be associated with automatic composition of monophonic pieces. We are concerned with the composition of e-music from finite field structures. The information at the input may be either random or information from a black-and-white, grayscale or color picture. New ecompositions and music score are made available, including a new piece from the famous Lenna picture: the score of the e-music “Between Lenna’s eyes in C major.” The corresponding stretch of music score are presented. Some particular structures, including clock arithmetic (mod 12), GF(7), GF(8), GF(13) and GF(17) are addressed. Further, multilevel block-codes are also used in a new approach of e-music composition, engendering a particular style as an “e-composer.” As an example, Pascal multilevel block codes recently introduced are handled to generate a new style of electronic music over GF(13).
منابع مشابه
Linear Complexity of Designs based on Coordinate Sequences of LRS and on Digital Sequences of Matrix/Skew LRS Coordinate Sequences over Galois Ring
This article continues investigation of ways to obtain pseudo-random sequences over Galois field via generating LRS over Galois ring and complication it. Previous work is available at http://eprint.iacr.org/2016/212 In this work we provide low rank estimations for sequences generated by two different designs based on coordinate sequences of linear recurrent sequences (LRS) of maximal period (MP...
متن کاملLow Linear Complexity Estimates for Coordinate Sequences of Linear Recurrences of Maximal Period over Galois Ring
In this work we provide low rank estimations for coordinate sequences of linear recurrent sequences (LRS) of maximal period (MP) over Galois ring R = GR(pn, r), p ≥ 5, r ≥ 2, with numbers s such that s = kr + 2, k ∈ N0.
متن کاملGalois Towers over Non-prime Finite Fields
In this paper we construct Galois towers with good asymptotic properties over any nonprime finite field F`; i.e., we construct sequences of function fields N = (N1 ⊂ N2 ⊂ · · · ) over F` of increasing genus, such that all the extensions Ni/N1 are Galois extensions and the number of rational places of these function fields grows linearly with the genus. The limits of the towers satisfy the same ...
متن کاملExpansion and linear complexity of the coordinate sequences over Galois rings
The coordinate sequences of the trace sequences over a Galois ring defined by the trace function are used significantly in cryptography, coding and communication applications. In this paper, a p-adic expansion for the coordinate sequences in terms of elementary symmetric functions is provided for the case that the characteristic p of the residue field of the Galois ring is an arbitrary prime, w...
متن کاملGalois LCD codes over finite fields
In this paper, we study the complementary dual codes in more general setting (which are called Galois LCD codes) by a uniform method. A necessary and sufficient condition for linear codes to be Galois LCD codes is determined, and constacyclic codes to be Galois LCD codes are characterized. Some illustrative examples which constacyclic codes are Galois LCD MDS codes are provided as well. In part...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1709.06663 شماره
صفحات -
تاریخ انتشار 2017